Regressive functions and combinatorial functions.
نویسندگان
چکیده
منابع مشابه
Regressive functions on pairs
We compute an explicit upper bound for the regressive Ramsey numbers by a combinatorial argument, the corresponding function being of Ackermannian growth. For this, we look at the more general problem of bounding g(n,m), the least l such that any regressive function f : [m, l] → N admits a min-homogeneous set of size n. Analysis of this function also leads to the simplest known proof that the r...
متن کاملCombinatorial Functions and Indecomposable Cardinals
Combinatorial functions are used to replace indecomposable cardinals in certain types of set theoretic arguments. This allows us to extend decidability results from nonchoice set theories to set theories with a principle of linear ordering.
متن کاملRational Functions Certify Combinatorial Identities
This paper presents a general method for proving and discovering combinatorial identities: to prove an identity one can present a certi cate that consists of a pair of functions of two integer variables. To prove the identity, take the two functions that are given, check that condition (1) below is satis ed (a simple mechanical task), and check the equally simple fact that the boundary conditio...
متن کاملCombinatorial Agency of Threshold Functions
In this paper, we study the combinatorial agency problem introduced by Babaioff, Feldmanand Nisan [7] and resolve some open questions posed in their original paper. Our results includea characterization of the transition behavior for the class of threshold functions. This resultconfirms a conjecture of [7], and generalizes their results for the transition behavior for the ORtech...
متن کاملCombinatorial Inequalities and Smoothness of Functions
In most of our work we have been concerned with the one-dimensional case, but here we shall be able to say something about the general case. Roughly speaking, our aim has been to use the finiteness of Iv,P(f) to derive a priori bounds for other important functionals of ƒ, such as its modulus of continuity or other high order norms. The bounds we have obtained involve, of course, M* and p but th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1967
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1094068843